A combinatorial characterization of regular anonymous perfect threshold schemes
نویسنده
چکیده
The notion of a regular anonymous perfect threshold scheme is introduced, and a combinatorial characterization for such a (2,w)-threshold scheme in terms of a regular difference family is given. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Recent results on combinatorial constructions for threshold schemes
A perfect (t, w, v; m)-threshold scheme is a type of combinatorial design that provides a way of distributing partial information (chosen from a set of v points called shadows) to w participants, so that any t of them can easily calculate one of m possible keys, but no subset of fewer than t participants can determine any partial information regarding the key. In this paper, we give a survey of...
متن کاملOn the bound for anonymous secret sharing schemes
In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on the size of the shares than the bound of Blundo and Stinson for anonymous (k, n)threshold schemes with 1 < k < n. Our bound is tight for k = 2. We also show a close relationship between optimum anonymous (2, n)threshold...
متن کاملClassification of Small Class Association Schemes Coming from Certain Combinatorial Objects Table of Contents
We explore twoor three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...
متن کاملCommunication-eecient Anonymous Group Identiication
Identiication schemes allow a user to identify herself to a verifying authority in a secure way (i.e., without revealing her secret key). Group identiication schemes allow a user to identify herself as a member of a group of users in a secure and anonymous way (i.e., without revealing her identity nor her secret key). Several identiication schemes and group identiication schemes have been propo...
متن کاملCharacterisations of Ideal Threshold Schemes
Since 1979 when threshold schemes were introduced by Blakley (Bla79) and Shamir (Sha79), many papers in this area have been published. These papers are mostly about particular designs and applications of threshold schemes. In this work, we are interested in characterisations of ideal threshold schemes rather than particular constructions. Of course, these characteristic properties do not depend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 85 شماره
صفحات -
تاریخ انتشار 2003